// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
signed main()
{
	int t=1;
	cin>>t;
	while(t--)
	{
		int n,m;
		cin>>n>>m;
		vector<vector<int>> v(n+1,vector<int>(m+1,1));
		bool f=0;	
		auto dp=v;
		for(int j=1;j<=m;j++)dp[0][j]=2;
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++)
			{
				char a;
				cin>>a;
				v[i][j]=a-'0';
				dp[i][j]=0;
				if(v[i][j]==1)
				{
					if(!v[i-1][j]&&!v[i][j-1])
					{
						f=1;
					}
					if(v[i-1][j]&&(dp[i-1][j]==2||dp[i-1][j]==3))
					{
						dp[i][j]=2;
					}
					if(v[i][j-1]&&(dp[i][j-1]==1||dp[i][j-1]==3))
					{
						if(dp[i][j]==2)dp[i][j]=3;
						else dp[i][j]=1;
					}
					if(dp[i][j]==0)f=1;
				}
			}
		}
		if(f)cout<<"NO"<<endl;
		else cout<<"YES"<<endl;
	}
	return 0;
}
